Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing
نویسندگان
چکیده
منابع مشابه
Perfect Secrecy and Statistical
There are two key properties of the above. First, given only c, Eve should not be able to learn what m is. Second, Dec(Enc(m)) = m, so that Bob can accurately determine the message that Alice wanted to send. Creating functions Enc and Dec which satisfy this is a fundamental problem of cryptography. But given the above encryption scheme, knowing what these functions are is enough for anyone to d...
متن کاملPerfect Secrecy and Adversarial Indistinguishability
Claude Shannon introduced an entropy model for information, and applied it to secrecy in communications. It supposes a source of information, Alice, which chooses among a set of possible messages. There is associated with this choice a likelihood that Alice would chose a particular message. Symbols are then sent across a channel to Bob. These symbols should refine Bob’s likelihood function, emp...
متن کاملPerfect Secrecy and Provable Security
Everyone knows that the one-time pad provides perfect security. But what does this mean? In this chapter, we make this concept precise. Also, we know that it is very difficult in practice to produce a truly random key for a one-time pad. In Section 2, we show quantitatively how biases in producing the key affect the security of the encryption. The topics of this chapter are part of the subject ...
متن کاملPerfect Secrecy in Wireless Networks
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The present paper extends Shannon’s notion of perfect secrecy to ad hoc wireless networks of computers. All of the wireless transmissions are insecure. This paper assumes a secure base-station communicating wirelessly using...
متن کاملSteiner tree packing revisited
The Steiner tree packing problem (STPP) in graphs is a long studied problem in combinatorial optimization. In contrast to many other problems, where there have been tremendous advances in practical problem solving, STPP remains very difficult. Most heuristics schemes are ineffective and even finding feasible solutions is already NP-hard. What makes this problem special is that in order to reach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2081450